Modified Newton’s Algorithm for Computing the Group Inverses of Singular Toeplitz Matrices
نویسندگان
چکیده
Newton’s iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration, the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix, the matrix-vector multiplication involved in Newton’s iteration can be done efficiently. We show that the convergence of the modified Newton iteration is still very fast. Numerical results are presented to demonstrate the fast convergence of the proposed method.
منابع مشابه
A Homotopic/Factorization Process for Toeplitz-like Matrices with Newton’s/Conjugate Gradient Stages
We modify our earlier homotopic process for iterative inversion of Toeplitz and Toeplitz-like matrices to improve the choice of the initial approximate inverses at every homotopic step. This enables us to control the condition of the auxiliary matrices and to accelerate convergence substantially. The algorithm extends our older approach where the input matrix was factorized into the product of ...
متن کاملComputing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration
We modify the algorithm of [1], based on Newton’s iteration and on the concept of 2-displacement rank, to the computation of the Moore-Penrose inverse of a rank-deficient Toeplitz matrix. Numerical results are presented to illustrate the effectiveness of the method.
متن کاملEla a Note on Newton and Newton–like Inequalities for M–matrices and for Drazin Inverses of M–matrices∗
In a recent paper Holtz showed that M–matrices satisfy Newton’s inequalities and so do the inverses of nonsingular M–matrices. Since nonsingular M–matrices and their inverses display various types of monotonic behavior, monotonicity properties adapted for Newton’s inequalities are examined for nonsingular M–matrices and their inverses. In the second part of the paper the problem of whether Draz...
متن کاملHomotopic residual correction processes
We present and analyze homotopic (continuation) residual correction algorithms for the computation of matrix inverses. For complex indefinite Hermitian input matrices, our homotopic methods substantially accelerate the known nonhomotopic algorithms. Unlike the nonhomotopic case our algorithms require no pre-estimation of the smallest singular value of an input matrix. Furthermore, we guarantee ...
متن کاملAcceleration of Newton’s Polynomial Factorization: Army of Constraints, Convolution, Sylvester Matrices, and Partial Fraction Decomposition
We try to arm Newton’s iteration for univariate polynomial factorization with greater convergence power by shifting to a larger basic system of multivariate constraints. The convolution equation is a natural means for a desired expansion of the basis for this iteration versus the classical univariate method, which is more vulnerable to foreign distractions from its convergence course. Compared ...
متن کامل